Constraint design rewriting

Constraint design rewriting

We propose an algebraic approach to the design and transformation of constraint networks, inspired by Architectural Design Rewriting. The approach can be understood as (i) an extension of ADR with constraints, and (ii) an application of ADR to the design of reconfigurable constraint networks. The main idea is to consider classes of constraint networks as algebras whose operators are used to den...

Graph Rewriting and Constraint

In this extended abstract we describe our approach to modelling the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. We use graphs to represent states of such systems , and graph rewriting to represent their evolutio...

Constraint contextual rewriting

Rewriting Constraint Models with Metamodels

An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may require translations between constraint programming languages, transformations of constraint representations, model optimizations, and tuning of solving strategies. In this paper, we introduce a pivot metamodel describing th...

Termination of Constraint Contextual Rewriting

Abstra t. The e e tive integration of de ision pro edures in formula simpli ation is a fundamental problem in me hani al veri ation. The main sour e of diÆ ulty o urs when the de ision pro edure is asked to solve goals ontaining symbols whi h are interpreted for the prover but uninterpreted for the de ision pro edure. To ope with the problem, Boyer & Moore proposed a te hnique, alled augmentati...